Parallel Computation of Distributed Genetic Algorithm on Loosely-coupled Multiprocessor Systems
نویسنده
چکیده
In this paper, we propose and evaluate a distributed and parallel processing method of genetic algorithms on the loosely-coupled multiprocessor systems. In the experimental evaluation, we observe that the solution quality depends on the network topology of the system and the communication frequency. The solution generated in the hypercube system and torus system was uniformly better than the completely-connected system and the ring topology system has the possibility to generate higher quality solutions even if its convergence speed is slow. Keyword: genetic algorithm, parallel processing, loosely-coupled multiprocessor system, network topology, optimization problem
منابع مشابه
Parallel Genetic Algorithms for Optimizing Morphological
In this paper several design methods for parallel genetic algorithms (PGAs) optimizing morphological lters are discussed and an optimal scale and machine independent PGA for a loosely coupled, homogeneous or inhomogeneous multiprocessor computer is developed. The optimization is made in terms of computation speed, parallelization eeciency and quality. Quality means, in this context, the tness o...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملDistributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of the global optimization criteria. For this purpose a program graph is interpreted as a multi-agent system. A game-theoretic model of interaction between agents is applied. Competetive coevolutionary genetic algorithm, termed loo...
متن کاملFunction Optimization with Coevolutionary Algorithms
The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with anothe...
متن کامل5 Two basic models of distributed computation
Distributed computing and parallel computing study different kinds of systems, but they both study concurrent algorithms that run on collections of processors. In parallel computing, processors are tightly coupled, which usually means they move in lockstep, communication between processors is fast, and neither processors nor communication channels suffer from errors. By contrast, in a distribut...
متن کامل